Primitive Subgroups of Wreath Products in Product Action
نویسنده
چکیده
This paper is concerned with finite primitive permutation groups G which are subgroups of wreath products W in product action and are such that the socles of G and W are the same. The aim is to explore how the study of such groups may be reduced to the study of smaller groups. The O'Nan-Scott Theorem (see Liebeck, Praeger, Saxl [12] for the most recent and detailed treatment) sorts finite primitive permutation groups into several types, the groups in any one type admitting a common discussion. One of the types (III(b) in [12]) consists of groups G which are contained in, and contain the socle of, a suitable wreath product W in product action. It is easy to see that in this case the socles of G and W actually coincide. Thus the aim here amounts to pursuing the discussion of primitive groups of this type beyond the conclusions reached, say, in [12]. It has not proved possible to make direct use of those conclusions here. Instead, it seems necessary to repeat, elaborate, extend, and recombine arguments from various proofs of the O'Nan-Scott Theorem. No attempt will be made here to trace the origins of the ideas so used. For a sketch of the main results, some terminology is needed. By a wreath product A Wr Sn we mean the usual semidirect product W of the symmetric group Sn and the n-fold direct power A" of the (abstract) group A. The projection of W onto Sn corresponding to this semidirect decomposition will be denoted by n. Consider n a permutation representation of W and take a point stabilizer Wo: this has an obvious direct factorization
منابع مشابه
Rooted Wreath Products
We introduce “rooted valuation products” and use them to construct universal Abelian lattice-ordered groups (with prescribed set of components) [CHH] from the more classical theory of [Ha]. The Wreath product construction of [H] and [HMc] generalised the Abelian (lattice-ordered) group ideas to a permutation group setting to respectively give universals for transitive (`-) permutation groups wi...
متن کاملWreath Decompositions of Finite Permutation Groups
There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The r...
متن کاملIsoclinism and Stable Cohomology of Wreath Products
Using the notion of isoclinism introduced by P. Hall for finite p-groups, we show that many important classes of finite p-groups have stable cohomology detected by abelian subgroups, see Theorem 4.4. Moreover, we show that the stable cohomology of the n-fold wreath product Gn = Z/p o · · · oZ/p of cyclic groups Z/p is detected by elementary abelian p-subgroups and we describe the resulting coho...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملOn minimal subdegrees of finite primitive permutation groups
We study the minimal non-trivial subdegrees of finite primitive permutation groups that admit an embedding into a wreath product in product action, giving a connection with the same quantity for the primitive component. We discover that the primitive groups of twisted wreath type exhibit different (but interesting) behaviour from the other primitive types. 2000 Mathematics Subject Classificatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011